On induced saturation for paths

For a graph H, G is H-induced-saturated if does not contain an induced copy of but either removing arbitrary edge from or adding non-edge to creates H. Depending on the necessarily exist. In fact, (Martin and Smith, 2012) showed that P4-induced-saturated graphs do exist, where Pk denotes path k vertices. Given it easy construct Pk-induced-saturated for k?{2,3}, (Axenovich Csikós, 2019) asked whether such exist k?5. Recently, Räty (2020) constructed P6-induced-saturated. this paper, we show there exists infinitely many values k. To be precise, each positive integer n, P3n-induced-saturated graphs. Furthermore, also Kneser K(n,2) P6-induced-saturated every n?5.